A Computational Model for Resolving Pronominal Anaphora in Turkish Using Hobbs' Naïve Algorithm
نویسندگان
چکیده
he this himself o bu kendi she that herself onu bunu kendisi it these itself onun bunun kendim his those themselves onlar bunlar kendin her others onları bunları kendimiz him onların bunların kendiniz its şu kendileri they şunu them şunun their şunlar şunları şunların Pronominal Anaphora in English Pronominal Anaphora in Turkish Abstract—In this paper we present a computational model for pronominal anaphora resolution in Turkish. The model is based on Hobbs’ Naїve Algorithm [4, 5, 6], which exploits only the surface syntax of sentences in a given text.
منابع مشابه
A Computational Model for Resolving Pronominal Anaphora in Turkish Using Hobbs- Naïve Algorithm
he this himself o bu kendi she that herself onu bunu kendisi it these itself onun bunun kendim his those themselves onlar bunlar kendin her others onları bunları kendimiz him onların bunların kendiniz its şu kendileri they şunu them şunun their şunlar şunları şunların Pronominal Anaphora in English Pronominal Anaphora in Turkish Abstract—In this paper we present a computational model for pronom...
متن کاملResolving Pronominal References in Chinese with the Hobbs Algorithm
This study addresses pronominal anaphora resolution, including zero pronouns, in Chinese. A syntactic, rule-based pronoun resolution algorithm, the “Hobbs algorithm” was run on “gold standard” hand parses from the Penn Chinese Treebank. While first proposed for English, the algorithm counts for its success on two characteristics that Chinese and English have in common. Both languages are SVO, a...
متن کاملExploring Semantic Information from Hindi Dependency Treebank for Resolving Pronominal Anaphora
Anaphora Resolution is exigent task in almost all NLP applications such as text summarization, machine translation, information extraction, question-answering systems, etc. A lot of work has been done for identifying and still more need to be done for finding the factors responsible for resolving the anaphoras in all languages. An attempt has been made to resolve Hindi pronominal anaphora using...
متن کاملA Computational Approach to Zero-pronouns in Spanish
In this paper, a computational approach for resolving zero-pronouns in Spanish texts is proposed. Our approach has been evaluated with partial parsing of the text and the results obtained show that these pronouns can be resolved using similar techniques that those used for pronominal anaphora. Compared to other well-known baselines on pronominal anaphora resolution, the results obtained with ou...
متن کاملUsing Latent Semantic Analysis for Pronominal Anaphora Resolution
This report presents a pronominal anaphora resolution algorithm that uses lexical knowledge (a.k.a. world knowledge) in the process of resolution. We use Latent Semantic Analysis (LSA) as the implementation of lexical knowledge. The algorithm is fully implemented and an automatic checking procedure is applied to assess its performance. We compare it to two other algorithms: a baseline algorithm...
متن کامل